package org.codehaus.mojo.unix.util.fj;

/*
 * The MIT License
 *
 * Copyright 2009 The Codehaus.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy of
 * this software and associated documentation files (the "Software"), to deal in
 * the Software without restriction, including without limitation the rights to
 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
 * of the Software, and to permit persons to whom the Software is furnished to do
 * so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

import fj.*;
import fj.data.*;

public class TreeZipperF
{
    public static <A> F<TreeZipper<A>, Tree<A>> toTree()
    {
        return new F<TreeZipper<A>, Tree<A>>()
        {
            public Tree<A> f( TreeZipper<A> treeZipper )
            {
                return treeZipper.toTree();
            }
        };
    }

    public static <A> F2<TreeZipper<A>, F<A, A>, TreeZipper<A>> modifyLabel_()
    {
        return new F2<TreeZipper<A>, F<A, A>, TreeZipper<A>>()
        {
            public TreeZipper<A> f( TreeZipper<A> treeZipper, F<A, A> f )
            {
                return treeZipper.modifyLabel( f );
            }
        };
    }

    public static <A> F<TreeZipper<A>, A> getLabel_()
    {
        return new F<TreeZipper<A>, A>()
        {
            public A f( TreeZipper<A> treeZipper )
            {
                return treeZipper.getLabel();
            }
        };
    }

    public static <A> F2<TreeZipper<A>, Tree<A>, TreeZipper<A>> insertDownFirst()
    {
        return new F2<TreeZipper<A>, Tree<A>, TreeZipper<A>>()
        {
            public TreeZipper<A> f( TreeZipper<A> treeZipper, Tree<A> tree )
            {
                return treeZipper.insertDownFirst( tree );
            }
        };
    }
}
